Is Defeasible Logic Applicable?∗
نویسندگان
چکیده
In this paper the application of defeasible logic for automated negotiation is investigated. Defeasible logic is flexible enough to be adapted to several possible negotiation strategies, has efficient implementations, and provides a formal basis for analysis (e.g. to explain why a negotiation was not successful). Two case studies, one small and one more comprehensive, will be described and the feasibility of approaches based on defeasible logic will be discussed.
منابع مشابه
Computing Strong and Weak Permissions in Defeasible Logic
In this paper we propose an extension of Defeasible Logic to represent and compute three concepts of defeasible permission. In particular, we discuss different types of explicit permissive norms that work as exceptions to opposite obligations. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from ...
متن کاملSuperiority Based Revision of Defeasible Theories
We propose a systematic investigation on how to modify a preference relation in a defeasible logic theory to change the conclusions of the theory itself. We argue that the approach we adopt is applicable to legal reasoning, where users, in general, cannot change facts and rules, but can propose their preferences about the relative strength of the rules. We provide a comprehensive study of the p...
متن کاملRevision of Defeasible Logic Preferences
There are several contexts of non-monotonic reasoning where a prior7 ity between rules is established whose purpose is preventing conflicts. 8 One formalism that has been widely employed for non-monotonic reasoning is 9 the sceptical one known as Defeasible Logic. In Defeasible Logic the tool used 10 for conflict resolution is a preference relation between rules, that establishes the 11 priorit...
متن کاملEmbedding Defeasible Logic Programs into Generalized Logic Programs
A novel argumentation semantics of defeasible logic programs (DeLP) is presented. Our goal is to build a semantics, which respects existing semantics and intuitions of “classical” logic programming. Generalized logic programs (GLP) are selected as an appropriate formalism for studying both undermining and rebutting. Our argumentation semantics is based on a notion of conflict resolution strateg...
متن کاملApplications of Nonclassical Logic Methods for Purposes of Knowledge Discovery and Data Mining1
Abstract: Methods for solution of a large class of problems on the base of nonclassical, multiple-valued, and probabilistic logics have been discussed. A theory of knowledge about changing knowledge, of defeasible inference, and network approach to an analogous derivation have been suggested. A method for regularity search, logic-axiomatic and logic-probabilistic methods for learning of terms a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001